System and method for load - balancing in a resource infrastructure running application programs

ABSTRACT

The idea of the present invention is to provide a challenge-response mechanism to acquire work scope split range information from the application&#39;s Work Scope Split component of the over-utilized resource. By using the work scope split range information, the provisioning system is able to add a new resource, install a new application for that new resource, configure the new and the over-utilized resource&#39;s application, and reconfigure the load-balancer in accordance with the work scope split range information. The present invention adds scalability to complex and stateful application programs and allows dynamic provisioning of resources for these application programs.

FIELD OF THE PRESENT INVENTION

The present invention relates to load-balance in general, and inparticular to load-balance by a provisioning system that managesresources running application programs, especially stateful applicationprograms.

BACKGROUND OF THE INVENTION

The term load-balance as used in the present invention means thefunctionality to divide the amount of computational workload that aresource (e.g. computer, server, application, storage media etc.) has todo between one or more resources (existing or added resources).

The term provisioning system as used in the present invention covers allcomponents which are required to accomplish load-balance in a resourceinfrastructure with a plurality of resources.

The term stateful application program as used in the present applicationmeans that each instance of an application program is dedicated to agroup of requests indicated by the request's content, and contraryhereto a stateless application program means that each instance of anapplication program can handle each incoming request.

PRIOR ART

A typical example of such provisioning system can be found in a web-sitehosting infrastructure (see FIG. 1A/B) that is composed of many servers(resources) that are dedicated to serving instances of web applicationsfor a number of different web sites.

Typically, a load-balancer (request dispatcher) “load-balances” requestsfrom the Internet to a suitable server. To decide which server to directthe request to, the load-balancer uses either a simple schedulingalgorithm like round-robin or load statistics.

The load-balancer has a list of servers that can be targeted. Forround-robin, the load-balancer goes through the list of all servers,targets the request at the next in the list and advances one positioningin the list. For load statistics, the server with the least amount ofcurrent workload is targeted. Hence, each request can be directed toeach server in the web farm.

The system utilization of the application server is monitored by aMonitor component. The utilization data or performance parameter arecorrelated by a correlation services component and compared againstcertain rules. As long as the service-level agreement (SLA), e.g.response time >2 second, can be fulfilled, no change will be made to thesystem setup. If a violation occurs, the correlation services componentrequests a new resource from the resource provisioning component. Theresource provisioning component provides a new server from a resourcepool and configures this server (e.g. installs, configures, starts theapplication etc.). The resource provisioning adds the new server to thelist of servers known by the load-balancer. At this point of time, theload-balancer is able to distribute the incoming workload not only overthe already existing servers, but also on the new provisioned serverusing simple scheduling algorithm (e.g. round robin).

In prior art scenarios with stateful application programs the abovementioned prior art load-balancer (round-robin or statistics) cannot beused. Instead a load-balancer is used which distributes the incomingrequests depending on their content information to the assignedapplication programs (see FIG. 1C). For example, the first server withits application program can only handle customer A-D, the second serverwith its application program can only handle E-H, and the third serverwith its application program can only handle J-M, the load-balancercannot simply distribute client requests of customer A-D to the secondor third server when the first server is over-utilized because they arededicated to the first server exclusively.

The prior art approach to avoid such over-utilization of servers issimply to use servers with stronger CPU (e.g. faster clock rate), moreCPUs, more storage capacity etc. A disadvantage of such an approach isthat configuration of the server infrastructure is determined on thehighest estimated peak workload.

Dynamically changing workloads have no effects to the configuration ofthe server infrastructure itself. Resources are permanently assigned toa certain server infrastructure without being permanently used. Thisincurs costs without resource use.

BRIEF SUMMARY OF THE INVENTION

The idea of the present invention is to provide a challenge-responsemechanism to acquire work scope split range information from theapplication's Work Scope Split component of the over-utilized resource.By using the work scope split range information, the provisioning systemis able to add a new resource, install a new application for that newresource, configure the new and the over-utilized resource'sapplication, and reconfigure the load-balancer in accordance with thework scope split range information. The present invention addsscalability to complex and stateful application programs and allowsdynamic provisioning of resources for these application programs.

Starting from this, the object of the present invention is to provide animproved method and system avoiding the disadvantages of the prior artapproaches.

The recitation herein of a list of desirable objects which are met byvarious embodiments of the present invention is not meant to imply orsuggest that any or all of these objects are present as essentialfeatures, either individually or collectively, in the most generalembodiment of the present invention or in any of its more specificembodiments.

BRIEF DESCRIPTION OF THE DRAWINGS

The subject matter which is regarded as the invention is particularlypointed out and distinctly claimed in the concluding portion of thespecification. The invention, however, both as to organization andmethod of practice, together with further objects and advantagesthereof, may best be understood by reference to the followingdescription taken in connection with the accompanying drawings in which:

FIG. 1A shows a prior art client-server infrastructure with aprovisioning system for stateless web applications before a resource isadded,;

FIG. 1B shows the prior art client-server infrastructure according toFIG. 1 with added resource;

FIG. 1C shows a prior art client-server infrastructure with aprovisioning system for stateful web applications;

FIG. 2A shows a client-server infrastructure according to FIG. 1Cextended by the present invention (without added n resource);

FIG. 2B shows a client-server infrastructure according to FIG. 1Cextended by the present invention (with added resource);

FIG. 2C shows a message flow diagram of the client-server infrastructureas shown in FIG. 2B; and

FIG. 3 shows a flow diagram of a preferred implementation of the methodcarried out by the work split component.

DETAILED DESCRIPTION OF THE INVENTION

With respect to FIG. 2A, there is depicted a client-serverinfrastructure extended by the present invention (without addedresource).

At the client system 1 side, there is preferably used an application forcreating client requests as well as a communication component forestablishing communication with the destination server infrastructure.In the case of Internet communication, the application is preferably abrowser. Each client request created by the application must includecontent information which allows distributing the respective clientrequest to its assigned web applications for further processing.

At the destination server infrastructure side, there is preferably usedone or more server systems 16 running stateful application programs 18,a load-balancer 15 for determining the respective application program 18for each incoming client request, and a provisioning system 3 formonitoring the computational workload of the resources, and for adding,installing and configuring new resources when over-utilization of aresource is detected.

In one preferred embodiment of the present invention, such aprovisioning system 3 comprises a Monitor component 13 for monitoringthe computational workload of the resources, a Work Scope SplitCorrelation Service Component 12, a Compliance Monitor component 5, anda Resource Provision Services Component 6.

The Work Scope Split Correlation Service Component 12 receivesperformance data 9 (e.g. CPU utilization, storage consumption, networkport utilization) provided by the Monitor 13, correlates the performancedata based on certain rules, compares them with the data provided by theCompliance Monitor 5, and finally decides whether the rules (thresholdlevel) are fulfilled or not. The Compliance Monitor 5 which may forexample provide access to customer service level agreements (e.g.database for SLA) identifies the respective SLA for the customer usingthe provided resources and provides the data, e.g. response time <2seconds) agreed in SLA to the Work Scope Split Correlation Servicecomponent.

When an over-utilization of a server is detected, the Work Scope SplitService Correlation Component 12 uses an external interface 11 beingprovided by the application program's Work Scope Split Component 19 forrequesting the workload split range information.

The external interface 11 defines how to request the workload scopesplit range information by defining interface name, protocol (e.g. XMLover HTTP), the request content (e.g. format and required inputparameter), and the expected response (e.g. format and outputparameters).

The Work Scope Split Component 19 has the functionality to provide asplit ratio of the actual computational workload of the over-utilizedserver 16 running the stateful application program 18 which allows theprovisioning system 3 to add a new resource taking over one part of thesplit workload.

In one preferred implementation of the present invention, the Work ScopeSplit Component 19 uses current performance data, e.g. performance dataprovided by the operating system 20, or from the stateful application 18itself (see FIG.3) for calculating the workload scope split rangeinformation.

In a preferred implementation the workload scope split range iscalculated by accessing one or more current performance data of theresource, adding the performance data of all ranges of activities (e.g.several queues) managed by the application program resulting in a totalworkload, calculating the half of the total workload, adding theperformance data of range of activities as long as the half of the totalworkload is not exceeded and the next to the last range of activity hasnot been reached resulting in a first workload scope split rangeinformation, and returning the first workload scope split rangeinformation and the remaining workload scope split range as workloadscope split range information to the Work Scope Split CorrelationServices component.

In another embodiment of the present invention the Work Scope SplitComponent 19 uses statistical performance data which is periodically andpersistently stored in a database. The statistical data are preferablyused to calculate a workload scope split range information in a way asdescribed in conjunction with the use current performance data.

A more detailed implementation of calculation of the workload scopesplit range information is disclosed with respect to FIG.3.

When using homogenous resources, the performance data is used tocalculate a workload split range information of the over-utilized serverin such way that both parts of the work scope split ranges will handlethe same computational workload.

In the case of heterogeneous resources, in addition a percentage spliton which the workload scope split range information should be based hasto be provided with the request created by the Work Scope SplitCorrelation service component 12. The work scope split range informationis then calculated in such a way that both parts of the work scope splitranges will handle a computational workload proportional to thesuggested percentage split (e.g. 30% to 70%).

The result of the work scope split will be used to reconfigure theapplication program 18 of the over-utilized server 16, to configure theapplication of the newly added server, and reconfigure the load-balancer15.

With respect to FIG. 2B, there is depicted a client-serverinfrastructure (resource infrastructure) extended by the presentinvention (with added resource) with its message flow diagram FIG. 2C.

The client-server infrastructure which can be, for example, a workplacemessaging infrastructure is composed of a number of components likeload-balancer, mail queue servers, web servers, database servers, etc.

Typically, a load-balancer 15 (request dispatcher) “load balance”requests from the Internet/Intranet to a suitable server 16. Theload-balancer 15 has a list of servers 16 to be targeted. Theload-balancer 15 uses either load statistics or analysis of the contentof the request to direct the request to the suitable server. Examples ofthe second case are the mail queue servers 16. Each mail queue server 16handles a specific number of queues, for example, all requestersstarting with the letters A to D. Incoming requests which are dedicatedto a specific queue must be therefore directed to the server 16 handlingthis queue and cannot be sent to an arbitrary mail queue server. Thelist of servers available to the load-balancer 15 contains a column thatidentifies the queue details, for example, range of letters handled bythis server. The load-balancer 15 inspects the incoming request,identifies the first letter of the requester and directs the request tothe server handling this first letter of the requester.

The system utilization (like CPU and network port utilization) of theapplication servers 16 is monitored by a Monitor component 10. Theutilization data or performance data are correlated by a Work ScopeSplit Correlation Service Component 12 and compared against certainrules. As long as the service level agreements (SLA), e.g. response time<2 seconds, can be fulfilled, no changes will be made to the systemset-up.

If an over-utilization occurs, the Work Scope Split Correlation ServiceComponent 12 requests the information on how the computational workloadof the application program can be split between an already existingserver 16 and a new server 16′. This information (workload scope splitrange information) will be provided by a Work Scope Split Component 19being part of the application 18 (or forming a separate component)running on the server that has sent the violation notification(over-utilized server). The Work Scope Split Correlation ServiceComponent will use an external interface 11 (as defined by theapplication) for requesting the Work Scope Split information from theWork Scope Split Component as described in more detail with respect toFIG. 2A.

The Work Scope Split Correlation Service Component 12 requests a newresource 16′ (server) from the resource provisioning component 6.Together with this request, it sends the workload split rangeinformation provided by the application's Work Scope Split Component 19to the Resource provisioning component 6.

The Resource provisioning component 6 provides a new server 16′ from aresource pool 30.

The Resource provisioning component 6 configures the application 18′ tobe started on the new server 16′ based on the suggested range, startsthe application 18′ on the new server 16′, reconfigures the application18 running on the existing server 16 based on the suggested range,restarts the application 18 on the existing server 16, adds the newserver 16′ to the list of servers known by the load-balancer 15, andreconfigures the load-balancer 15 based on the new work scope split.

For example, instead of one server 16 handling letters A to D, now twoservers are available, one handling the letters A to B and the other onehandling letter C to D. At this point in time, the load-balancer 15 isable to distribute the incoming workload not only over the alreadyexisting servers, but also on the new provisioned server according tothe individual request content.

With respect to FIG. 3, there is depicted a floating diagram of apreferred implementation of the method carried out by Work Scope SplitComponent.

The diagram describes a simple method which could be used by the WorkSplit component to calculate the workload scope split range information.

Basically, this algorithm calculates first the sum of all activities byadding up the performance data of all individual sections (range ofactivities) 10, 20. It then calculates the work scope split range insuch a way that both ranges (start section . . . current section/currentsection+1 . . . end section) will handle the same workload.

It is noted that this algorithm is only applicable if at least twoindividual sections exist. In other words, it would not be possible tocalculate the Work Scope Split by splitting up one single individualsection into two ranges.

Related to the client-server infrastructure as described with respect toFIG. 2B/C, the method would calculate the workload scope split range ofall queues hosted by the mail queue server, based on the currentperformance data.

More precisely, the method would calculate the total workload by addingthe current queue length of all queues hosted by the mail queue server.To give an example, let us assume that four queues A, B, C and D arehosted by the server and that the current queue length of queue A is 10,queue B is 2, queue C is 0 and queue D is 4. In this case, the totalqueue length would be 16. Then it would split the list of queues intotwo groups in such a way, that both groups will handle the same workload.

More precisely, starting with the first queue, the method woulditeratively add the current queue length of the queues hosted by themail queue server while the half of the calculated total queue length isnot reached or exceeded and at least two queues remain for which thequeue length has to be added. Related to the example with the fourqueues A, B, C and D, the method would start with queue A and add thequeue length of queue A which would result in an added up queue lengthof 10. The method would then compare this added up queue length with thehalf of the total queue length calculated in the previous step. Relatedto our example, the method would compare 10 as accumulated queue lengthwith 8 as the half of total queue length. The method would then decideto break the iteration because the half of the calculated total queuelength is exceeded. As the last step, the method would return two listsof queues as result. The first list would contain queue A only; thesecond list would contain queue B, C and D.

Instead of using the current performance data (current queue length inthe described example above), it would also be possible to use thestatistical average performance data (average queue length) over acertain period of time.

While the invention has been described in detail herein in accord withcertain preferred embodiments thereof, many modifications and changestherein may be effected by those skilled in the art. Accordingly, it isintended by the appended claims to cover all such modifications andchanges as fall within the true spirit and scope of the invention.

1. A method of distributing the computational workload of a resourceover at least one other resource, the method comprising the steps of:monitoring the computational workload on a first resource running afirst instance of an application program; automatically requestingworkload split range information from said first instance if saidcomputational workload of said first resource exceeds a definedthreshold level; calculating workload split range information for saidcomputational workload on said first resource if said threshold isexceeded, and returning said workload split range information to saidfirst instance of said application program; and preparing a new instanceof said application program on another resource and distributing saidcomputational workload of said application program over said at leastone other resource in accordance with said workload split rangeinformation.
 2. The method according to claim 1, wherein thecomputational workload is defined by one or more performance data forsaid first resource.
 3. The method according to claim 1, wherein saidperformance data of said first resource are provided by the resource'soperating system or by the first application instance.
 4. The methodaccording to claim 1, wherein said threshold level is defined by oneperformance parameter or by the correlation of performance parameters ofsaid resource.
 5. The method according to claim 1, wherein said workloadsplit range information is calculated by using performance data of saidfirst resource provided by the resource's operating system or by saidapplication instance of said first resource.
 6. The method according toclaim 5, wherein said workload scope split range calculation comprisesthe steps of: accessing one or more current performance parameters ofsaid first resource; adding all said performance data of all ranges ofactivities managed by said application instance resulting in a totalworkload; calculating half of the total workload; adding saidperformance data of said ranges of activities as long as half of thetotal workload is not exceeded and the next to the last range ofactivity has not been reached resulting in a first workload scope splitrange indication; and returning said first workload scope split rangeindication and the remaining workload scope split range information asworkload scope split range information.
 7. The method according to claim1, wherein said workload scope split range is divided approximately inhalf.
 8. A provisioning system for a resources infrastructure with aplurality of resources running instances of application programs,comprising: a component for monitoring computational workload of saidresources; a component for comparing the computational workload of eachof said resources with a defined threshold level and initiating achallenge-response mechanism to acquire work scope split rangeinformation from said instances of said application programs when saiddefined threshold data is exceeded; and a component for adding a newresource to said resource infrastructure and distributing thecomputational workload in accordance with the work scope splitinformation.
 9. The provisioning system according to claim 8, furthercomprising: a communication link to a load-balancer to reconfigure it inaccordance with the work scope split range information; and acommunication link to a resource pool which provides free resources foradding new resources, and for installing and configuring applicationprograms thereon.
 10. The provisioning system according to claim 8,wherein said challenge-response mechanism is defined by an interfaceprovided by said instances of said application programs.
 11. Theprovisioning system according to claim 10, wherein said applicationprograms are stateful application programs.
 12. A resource in a resourceinfrastructure with a plurality of resources managed by a provisioningsystem, wherein said resource runs an application program, wherein saidapplication program is characterized as having a work split rangecomponent for calculating the work scope split range for thecomputational workload of the resource; and an interface component whichdefines a challenge-response mechanism for requesting and providing workscope split range information generated by said work split component tosaid provisioning system comprising a component for monitoringcomputational workload of said resource, a component for comparing saidcomputational workload of said resource with a defined threshold leveland for initiating a challenge-response mechanism to acquire work scopesplit range information from said application program when said definedthreshold is exceeded, and a component for adding a new resource and fordistributing the computational workload in accordance with the workscope split range information to said new resource.
 13. The resourceaccording to claim 12, wherein said application is a statefulapplication.
 14. The resource according to claim 12, wherein saidresource is a computer system.
 15. A computer program product stored inthe internal memory of a digital computer, containing software code toexecute the method in accordance with claim 1 if the product is run onthe computer.